منابع مشابه
Space-efficient Basic Graph Algorithms
We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that. For computing connected components and performing breadth-first search, we match the running times of standard algorithms that have no memory restrictions, for depth-first search and related problems...
متن کاملThe network approach: basic concepts and algorithms
1 The network approach as a physical problem As economists are the experts on consumer attitudes and sociologists on human social interaction, physicists are the experts simplifying complex problems. However, one usually does not ask a physicist about stock-market forecasts [1], neither does one immediately think of a physicist when the issue concerns controlling civilian crowds [2]. Scientists...
متن کاملGraph Algorithms for Network Connectivity Problems
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.
متن کاملEfficient Graph Algorithms for Network Analysis
We provide efficient algorithms for two major problems in network analysis. One is the Graph Center (GC) problem and the other is the Graph Bottleneck (GB) problem. The GC problem is relevant for facility location, while the GB problem is relevant for transportation and logistics. The GC problem is to identify a pre-determined number of center vertices such that the distances or costs from (or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1990
ISSN: 0307-904X
DOI: 10.1016/0307-904x(90)90178-8